Mathematical Programming Guides Air-Ambulance Routing at Ornge

نویسندگان

  • Tim Carnes
  • Shane G. Henderson
  • David B. Shmoys
  • Mahvareh Ahghari
  • Russell D. MacDonald
چکیده

Introduction The province of Ontario, Canada has approximately thirteen million residents spread over approximately one million square kilometers. Ontario ensures a high level of medical care for all residents partly through an advanced medical transport capability. The not-forprofit company Ornge provides these transport services primarily through air-ambulance services, although it also has several land ambulances. Ornge transports approximately 19,000 patients every year. These transports can be broken down into “scene calls” and “inter-facility transports.” Scene calls are those calls that immediately spring to mind when one thinks of air-ambulance service: paramedics respond to the location of an accident by

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Multi-Period Mathematical Programming Model for Maximal Covering Location Problem

In this paper, a model is presented to locate ambulances, considering backup facility (to increase reliability) and the restriction of ambulance capacity. This model is designed for emergencies. In this model the covered demand for each demand point depends on the number of coverage times and the amount of demand. The demand amount and ambulance coverage radius are considered...

متن کامل

Ambulance routing in disaster response scenario considering different types of ambulances and semi soft time windows

This paper studies the ambulance routing problem (ARP) in disaster situations when a large number of injured people from various locations require receiving treatments and medical aids. In such circumstances, many people summoning the ambulances but the capacity and number of emergency vehicles are not sufficient to visit all the patients at the same time. Therefore, a pivotal issue is to manag...

متن کامل

A Node-based Mathematical Model towards the Location Routing Problem with Intermediate Replenishment Facilities under Capacity Constraint

In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

متن کامل

A multi-product vehicle routing scheduling model with time window constraints for cross docking system under uncertainty: A fuzzy possibilistic-stochastic programming

Mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. Despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. This issue renders the proposed mathematical models inapplicable due largely to the fact th...

متن کامل

A Comprehensive Mathematical Model for a Location-routing-inventory Problem under Uncertain Demand: a Numerical Illustration in Cash-in-transit Sector

The purpose of this article is to model and solve an integrated location, routing and inventory problem (LRIP) in cash-in-transit (CIT) sector. In real operation of cash transportation, to decrease total cost and to reduce risk of robbery of such high-value commodity. There must be substantial variation, making problem difficult to formulate. In this paper, to better fit real life applications ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Interfaces

دوره 43  شماره 

صفحات  -

تاریخ انتشار 2013